A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem

We consider a well-known NP-hard deterministic inventory control problem: the One-Warehouse Multi-Retailer (OWMR) problem. We present a simple combinatorial algorithm to recombine the optimal solutions of the natural single-echelon inventory subproblems into a feasible solution of the OWMR problem. This approach yields a 3approximation. We then show how this algorithm can be improved to a 2-approximation by halving the demands at the warehouse and at the retailers in the subproblems. Both algorithms are purely combinatorial and can be implemented to run in linear time for traditional linear holding costs and quadratic time for more general holding cost structures. We finally show that our technique can be extended to the Joint Replenishment Problem (JRP) with backorders and to the OWMR problem with non-linear holding costs. ∗Bordeaux Institute of Mathematics, 351 cours de la Liberation, 33405 Talence, France. [email protected] †Laboratoire G-SCOP, Grenoble INP, 46 Avenue Félix Vialet, 38031 Grenoble Cedex, France. [email protected] ‡Laboratoire G-SCOP, Grenoble INP, 46 Avenue Félix Vialet, 38031 Grenoble Cedex, France. [email protected] §Laboratoire G-SCOP, Grenoble INP, 46 Avenue Félix Vialet, 38031 Grenoble Cedex, France. [email protected]